#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T>
using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x)&(-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz size()

void solve () {
    int n, q;
    cin >> n >> q;
    V<int>w (n + 1, 0);
    int sum = 0, lst = -1;

    map<int, V<int>>mp;
    FOR (i, 1, n)cin >> w[i], sum += w[i], mp[i].eb (w[i]);

    while (q--){
        int op, i, x;
        cin >> op;
        if (op == 1){
            cin >> i >> x;
            if (lst == -1){
                sum -= mp[i].back ();
                sum += x;
            } else{
                if (mp[i].sz){
                    sum -= mp[i].back ();
                    sum += x;
                } else{
                    sum -= lst;
                    sum += x;
                }
            }
            mp[i].eb (x);
            cout << sum << endl;
        } else{
            cin >> x;
            lst = x;
            sum = x * n;
            mp.clear ();
            cout << sum << endl;
        }
    }
}

signed main () {
    int Task = 1;

    ios::sync_with_stdio (false);
    cin.tie (nullptr);

    while (Task--) {
        solve ();
    }

    return 0;
}